在双向链表存储结构中，删除p所指的结点时须修改指针（ ）。A:p->next->prior=p->prior; p->prior->next=p->next; B:p->next=p->next->next; p->next->prior=p; C:p->prior->next=p; p->prior=p->prior->prior; D:p->prior=p->next->next; p->next=p->prior->prior; 答案: p->next->prior=p->prior; p->prior->next=p->next;